Improved Anti-Collision Algorithm for the Application on Intelligent Warehouse
نویسندگان
چکیده
منابع مشابه
Application of Improved RFID Anti - Collision Algorithm in Library Management
Radio Frequency identification (RFID) has integrated a wide range of applications for the identification and traceability of benefits . The tag collision remains a major drawback in radiofrequency identification systems, especially in large-scale ones. Thus it is critical to establish algorithms on the basis of hardware to realize accurate and efficient identification to optimize the system.Bas...
متن کاملAN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM
This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...
متن کاملAn Improved Query Tree Anti-Collision Algorithm Using Collision Location
In order to reduce the identification delay and the energy consumption of the Query Tree Anti-collision Algorithm, the disadvantage of the current query tree anti-collision algorithms is analyzed and an improved query tree anti-collision algorithm is proposed, which is called collision Location based Hybrid Query Tree (LHQT) algorithm. In the algorithm, Manchester code is used and collision loc...
متن کاملAn Improved Anti-collision Algorithm Based on JDS
With the emergence of active tags and RFID technology used in the fast-moving objects, readers need urgently to read and write tags in limited time. Anticollision algorithms resolve the problem of a number of tags at the same time to communicate with the reader. Traditional anti-collision algorithm is to minimize recognition time and improve search efficiency under the conditions of maintaining...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2019
ISSN: 2076-3417
DOI: 10.3390/app9081596